Preferable-interval Approaches to the Single-sink Fixed-charge Transportation Problem
نویسنده
چکیده
The single-sink fixed-charge transportation problem is an important problem with applications in many areas. In this paper, a new concept of preferable interval is introduced. Properties of optimal solutions to the single-sink fixed-charge transportation problem are investigated. Solution approaches using preferable intervals are presented.
منابع مشابه
Preferable-Interval Method for the Multiple-Sink Fixed-Charge Transportation Problem
In this technical report, we study the multiple-sink fixed-charge transportation problem (MSFCTP), which arises frequently in application areas of scheduling and cost control, such as facility planning, capital budgeting, resource allocation, buffer allocation, pollution control, etc. The MSFCTP problem involves the distribution from a set of supply centers (sources) to a set of demand centers ...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملAnalysis of some greedy algorithms for the single-sink fixed-charge transportation problem
The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been prop...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملSingle-Sink Fixed-Charge Transportation: Applications and Exact Solution Algorithms
The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of supplier nodes to a single demand node. Shipping costs comprise costs proportional to the amount shipped as well as a fixed charge. Although the SSFCTP is an important special case of the well known fixed-charge transportation problem, only a few methods for solving this problem...
متن کامل